منابع مشابه
TRIOT: Faster tensor manipulation in C++11
Context: Multidimensional arrays are used by many different algorithms. As such, indexing and broadcasting complex operations over multidimensional arrays are ubiquitous tasks and can be performance limiting. Inquiry: Simultaneously indexing two ormoremultidimensional arrays with different shapes (e.g., copying data from one tensor to another larger, zero padded tensor in anticipation of a conv...
متن کاملFaster Tensor Canonicalization
The Butler-Portugal algorithm for obtaining the canonical form of a tensor expression with respect to slot symmetries and dummy-index renaming suffers, in certain cases with a high degree of symmetry, from O(n!) explosion in both computation time and memory. We present a modified algorithm which alleviates this problem in the most common cases—tensor expressions with subsets of indices which ar...
متن کاملTensor manipulation in GPL Maxima
GPL Maxima is an open-source computer algebra system based on DOE-MACSYMA. GPL Maxima included two tensor manipulation packages from DOE-MACSYMA, but these were in various states of disrepair. One of the two packages, CTENSOR, implemented component-based tensor manipulation; the other, ITENSOR, treated tensor symbols as opaque, manipulating them based on their index properties. The present pape...
متن کاملmanipulation in dubbing and subtitling
پژوهش حاضر در چارچوب مکتب دستکاری قرار گرفت و با استفاده از تقسیم بندی دوکات (2007) از شیوه های دستکاری، به دنبال یافتن پاسخ برای پرسش های زیر بود: 1-رایج ترین شیوه دستکاری در دوبله فیلم ها کدام است؟ 2-رایج ترین شیوه دستکاری در زیرنویس فیلم ها کدام است؟ 3-دستکاری در دوبله فیلم ها رایج تر است یا در زیرنویس آن ها؟ این پژوهش از نوع تحقیقات توصیفی- مقایسه ای و پیکره ای می باشد. پیکره تحقیق شا...
Faster Logic Manipulation for Large Designs
When logic transformations, such as circuit restructuring, technology mapping, and post-mapping optimization, are repeatedly applied to large hardware designs, millions of relatively small (6-16 input) Boolean functions have to be efficiently manipulated. This paper focuses on a novel representation of these small functions, in terms of their disjoint-support decomposition (DSD) structures. A n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Art, Science, and Engineering of Programming
سال: 2017
ISSN: 2473-7321
DOI: 10.22152/programming-journal.org/2017/1/6